Multichannel Fourier-transform interferometry for fast signals
نویسندگان
چکیده
منابع مشابه
calculation of computational complexity for radix-2p fast fourier transform algorithms for medical signals
due to its simplicity radix-2 is a popular algorithm to implement fast fourier transform. radix - 2 p algorithms have the same order of computational complexity as higher radices algorithms, but still retain the simplicity of radix-2 . by defining a new concept, twiddle factor template , in this paper we propose a method for exact calculation of multiplicative complexity for radix-2 p algorithm...
متن کاملMultichannel Fourier Transform Raman Spectroscopy: Combining the Advantages of CCDs with Interferometry
A common-path (Sagnac) interferometer combined with a chargecoupled device (CCD) was evaluated for Raman spectroscopy in the near-infrared region. A spatial interferogram of the scattered light was projected onto the face of the CCD, and a Fourier transform of the intensity vs. pixel data yielded a Raman spectrum. This mult ichannel Fourier transform (MCFT) technique retains several advantages ...
متن کاملInteger fast Fourier transform
In this paper, a concept of integer fast Fourier transform (IntFFT) for approximating the discrete Fourier transform is introduced. Unlike the fixed-point fast Fourier transform (FxpFFT), the new transform has the properties that it is an integer-to-integer mapping, is power adaptable and is reversible. The lifting scheme is used to approximate complex multiplications appearing in the FFT latti...
متن کاملPipeline Fast Fourier Transform
This paper describes a novel structure for a hardwired fast Fourier transform (FFT) signal processor that promises to permit digital spectrum analysis to achieve throughput rates consistent with extremely wide-band radars. The technique is based on the use of serial storage for data and intermediate results and multiple arithmetic units each of which carries out a sparse Fourier transform. Deta...
متن کاملCoreFFT Fast Fourier Transform
• Forward and Inverse 32-, 64-, 128-, 256-, 512-, 1,024-, and 2,048-Point Complex FFT • Decimation–In-Time (DIT) Radix-2 Implementation Optimized for Actel FPGAs • Selection of Unconditional or Conditional Block Floating-Point Scaling • Embedded RAM-Block-Based Twiddle Factor Generator • 8to 16-Bit Configurable Input/Output Data and Twiddle Coefficients Precision • Naturally Ordered Input and O...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Optics Express
سال: 2011
ISSN: 1094-4087
DOI: 10.1364/oe.19.012628